Decidability of Bisimulation Equivalence for First-Order Grammars
نویسنده
چکیده
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata.
منابع مشابه
Bisimulation Equivalence of First-Order Grammars
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (de-terministic pushdown automata) equivalence, and the result corresponds to the result achieved by Sénizergues (1998, 2005) in the framework of equational graphs, or of PDA with restricted ε-steps....
متن کاملBisimulation Equivalence for First-Order Grammars
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative to Sénizergues’ decidability proof (1998, 2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for the famous problem of language equivalence of deterministic pushdown automata (1997, 2001). On...
متن کاملBisimulation equivalence of first-order grammars is Ackermann-hard
Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Sénizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree, or of pushdown automata (PDA) with only deterministic and popping ε-transitions. Benedikt, Göller, Kiefer, and Murawski (2013) have shown that the bisimilar...
متن کاملJancar's formal system for deciding bisimulation of first-order grammars and its non-soundness
We construct an example of proof within the main formal system from [Jan10], which is intended to capture the bisimulation equivalence for non-deterministic first-order grammars, and show that its conclusion is semantically false. We then locate and analyze the flawed argument in the soundness (meta)-proof of [Jan10].
متن کاملA Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars
The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famousproblem solved by G. Sénizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim.
متن کامل